package com.sxkiler.demo.medium;

import org.junit.jupiter.api.Assertions;
import org.junit.jupiter.api.Test;
import java.util.*;
import com.sxkiler.demo.model.*;

/**
print-words-vertically=竖直打印单词
<p>给你一个字符串&nbsp;<code>s</code>。请你按照单词在 <code>s</code> 中的出现顺序将它们全部竖直返回。<br>
单词应该以字符串列表的形式返回，必要时用空格补位，但输出尾部的空格需要删除（不允许尾随空格）。<br>
每个单词只能放在一列上，每一列中也只能有一个单词。</p>

<p>&nbsp;</p>

<p><strong>示例 1：</strong></p>

<pre><strong>输入：</strong>s = "HOW ARE YOU"
<strong>输出：</strong>["HAY","ORO","WEU"]
<strong>解释：</strong>每个单词都应该竖直打印。 
 "HAY"
&nbsp;"ORO"
&nbsp;"WEU"
</pre>

<p><strong>示例 2：</strong></p>

<pre><strong>输入：</strong>s = "TO BE OR NOT TO BE"
<strong>输出：</strong>["TBONTB","OEROOE","   T"]
<strong>解释：</strong>题目允许使用空格补位，但不允许输出末尾出现空格。
"TBONTB"
"OEROOE"
"   T"
</pre>

<p><strong>示例 3：</strong></p>

<pre><strong>输入：</strong>s = "CONTEST IS COMING"
<strong>输出：</strong>["CIC","OSO","N M","T I","E N","S G","T"]
</pre>

<p>&nbsp;</p>

<p><strong>提示：</strong></p>

<ul>
	<li><code>1 &lt;= s.length &lt;= 200</code></li>
	<li><code>s</code>&nbsp;仅含大写英文字母。</li>
	<li>题目数据保证两个单词之间只有一个空格。</li>
</ul>

 */
public class printVertically {
    

    class Solution {
        public List<String> printVertically(String param0) {
            return null;
        }
    }

    @Test
    public void test(){
        Solution solution = new Solution();
        /**
        "HOW ARE YOU"
        */
        //int [] num1 = new int[]{1,3};
        //int [] num2 = new int[]{2};
        //Assertions.assertEquals(solution.{{questionName}}(num1,num2),2);
    }
}

